A Hybrid Simulated Annealing with Solutions Memory for Curriculum-based Course Timetabling Problem
نویسندگان
چکیده
منابع مشابه
A simulated annealing approach to the curriculum-based course timetabling problem
Course timetabling is a typical problem that all universities around the world have to face every semester. There exist a number of variants of this problem, depending on the specific requirements of the institution involved [13]. Thanks also to the international timetabling competition ITC-2007 [11], two formulations have, to some extent, lifted up to the status of “standard”. These are the so...
متن کاملFeature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as curriculumbased course timetabling problem (CB-CTT), which has been tackled by many researchers and has many available benchmarks. The contributions of this paper are twofold. On the one side, we propose an...
متن کاملHybrid CP+LNS for the Curriculum-Based Course Timetabling Problem
Course Timetabling (CTT) [11] is a popular combinatorial optimization problem, which deals with generating university timetables by scheduling weekly lectures, subject to conflicts and availability constraints, while minimizing costs related to resources and user discomfort. In CB-CTT, students enrol to curricula i.e., (possibly overlapping) collections of courses. Lectures of courses pertainin...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA Simulated Annealing Hyper-heuristic for University Course Timetabling
The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2013
ISSN: 1812-5654
DOI: 10.3923/jas.2013.262.269